worst and average case - PDFSEARCH.IO - Document Search Engine

worst and average case
Results: 57

#	Item
31	How to Catch L2 -Heavy-Hitters on Sliding Windows Vladimir Braverman1, Ran Gelles2 , and Rafail Ostrovsky3 1 Department of Computer Science, Johns Hopkins University, . Department of Computer Science, Univ Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-04-18 06:23:09 Theory of computation Circuit complexity NC Best worst and average case Ogonek Theoretical computer science
32	Staged Self-Assembly and Polyomino Context-Free Grammars? Andrew Winslow?? Department of Computer Science, Tufts University, Add to Reading List Source URL: www.eecs.tufts.edu Language: English - Date: 2013-11-14 23:09:11 Mathematical games Polyforms Mathematics Polyomino Analysis of algorithms Formal languages Stochastic context-free grammar Logarithm Best worst and average case
33	LU-CS-TR:LUNFD6/(NFCS–)], Lund University, Sweden NOTES ON SUFFIX SORTING N. JESPER LARSSON Abstract. We study the problem of lexicographically sorting the suffixes of a string of symbols. In pa Add to Reading List Source URL: www.larsson.dogma.net Language: English - Date: 2003-04-20 17:07:09 Sorting algorithms Order theory Computing Mathematics Suffix array Quicksort Suffix tree Radix sort Bucket sort Best worst and average case Sort LCP array
34	Project Summary The design and analysis of network algorithmics solutions is a rich area of research that has led to numerous successful deployments in commercial Internet routers and network monitoring appliances. In ge Add to Reading List Source URL: www.cc.gatech.edu Language: English - Date: 2014-03-25 14:56:33 Computational complexity theory Cybernetics Formal sciences Computer science Best worst and average case Stochastic Algorithm Control theory Applied mathematics Mathematics Analysis of algorithms
35	Dynamics of Algorithmic Processing in Computer Systems Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-06-20 13:21:03 Analysis of algorithms Computational complexity theory Sorting algorithms Algorithm Complexity Best worst and average case Insertion sort Worst-case complexity Distributed computing Theoretical computer science Applied mathematics Mathematics
36	A Fast Set Intersection Algorithm for Sorted Sequences Ricardo Baeza-Yates Center for Web Research Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2004-07-28 17:48:34 Search algorithms Analysis of algorithms Binary search algorithm Algorithm Set Best worst and average case Binary search tree Sorting algorithm Mathematics Theoretical computer science Applied mathematics
37	Average-case complexity analysis of perfect sorting by reversals Mathilde Bouvel1 Cedric Chauve2 Dominique Rossin1 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-24 09:20:20 Computational complexity theory Abstract algebra Permutation Best worst and average case Sorting Sorting algorithms Mathematics Combinatorics
38	No 11 Analysing case studies: Combining theory with practice Case studies tell a story. They set out a situation or actual event. Case study analysis involves reading the story, determining what is happening, finding th Add to Reading List Source URL: business.curtin.edu.au Language: English - Date: 2015-02-11 00:33:40 Methodology Data collection Ethology Grammar Human communication Question Case study Economic model Best worst and average case Science Evaluation methods Research methods
39	Adaptive Algorithms for Problems Involving Black-Box Lipschitz Functions by Ilya Baran B.S., Massachusetts Institute of Technology (2003) Add to Reading List Source URL: www.mit.edu Language: English - Date: 2006-02-03 21:38:13 Computational complexity theory Online algorithms Algorithm Competitive analysis Best worst and average case Asymptotically optimal algorithm Approximation algorithm Theoretical computer science Applied mathematics Analysis of algorithms
40	CALL FOR PAPERS ANALYSIS OF ALGORITHMS Special Issue in Algorithmica Average-Case Analysis of Algorithms is the area of Theoretical Computer Science that studies the behavior of algorithms on random inputs. The focus is Add to Reading List Source URL: algo.inria.fr Language: English - Date: 2004-11-13 12:22:28 Computer science Mathematics Probabilistic analysis of algorithms Algorithm Randomized algorithm Best worst and average case Combinatorics Amortized analysis Analysis of algorithms Applied mathematics Probabilistic complexity theory